Invertible Substitutions with a Common Periodic Point

نویسنده

  • HUI RAO
چکیده

We characterize the invertible substitutions over a two-letter alphabet which share a common periodic point (or fixed point). The argument is geometrical.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 7 . 28 76 v 1 [ m at h . D S ] 1 6 Ju l 2 00 9 Bratteli - Vershik representations of some one - sided substitution subshifts †

We study one-sided substitution subshifts, and how they can be respresented using Bratteli-Vershik systems. In particular we focus on minimal recognizable substitutions such that the generated one-sided substitution subshift contains only one non-shift-invertible element, and we call these substitutions quasi-invertible. We characterise these substitutions, and show that if the substitution is ...

متن کامل

Invertible substitutions and Sturmian sequences

It is known on the one hand that a Sturmian sequence can be generated geometrically by the intersections of a straight line with the unit grid in the plane, and on the other hand that fixed points of invertible substitutions are Sturmian. We give a new characterization of invertible substitutions, which allows to determine the straight line which generates the fixed point of a given invertible ...

متن کامل

Bratteli-Vershik adic representations of some one-sided substitution subshifts

We study one-sided substitution subshifts, and how they can be respresented using BratteliVershik systems. In particular we focus on minimal recognizable substitutions such that the generated one-sided substitution subshift contains only one non-shift-invertible element (branch point), and we call these substitutions quasi-invertible. We characterise these substitutions, and show that if the su...

متن کامل

Decomposition theorem for invertible substitutions on three - letter alphabet ∗

We study the structure of invertible substitutions on three-letter alphabet. We show that there exists a finite set S of invertible substitutions such that any invertible substitution can be written as Iw ◦ σ1 ◦ σ2 ◦ · · · ◦ σk, where Iw is the inner automorphism associated with w, and σj ∈ S for 1 ≤ j ≤ k. As a consequence, M is the matrix of an invertible substitution if and only if it is a f...

متن کامل

On substitution invariant Sturmian words: an application of Rauzy fractals

Sturmian words are infinite words that have exactly n+ 1 factors of length n for every positive integer n. A Sturmian word sα,ρ is also defined as a coding over a two-letter alphabet of the orbit of point ρ under the action of the irrational rotation Rα : x 7→ x+ α (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investiga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006